Scalable spaces
نویسندگان
چکیده
Scalable spaces are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their of (flat) differential forms. This is a rational homotopy invariant property and all scalable formal; indeed, scalability can be thought as metric version formality. They also characterized by particularly nice behavior from the point view quantitative theory. Among other results, we show that which formal but not provide counterexamples to Gromov’s long-standing conjecture on distortion higher groups.
منابع مشابه
Towards Scalable Information Spaces
Recent work in the field of middleware technology proposes semantic spaces as a tool for coping with the scalability, heterogeneity and dynamism issues of large scale distributed IT environments. In this paper we discuss the impact that functional and non-functional requirements have on the scalability of a semantic space installation. Based on this analysis we elaborate on the application scen...
متن کاملScalable Similarity Search in Metric Spaces
Similarity search in metric spaces represents an important paradigm for content-based retrieval of many applications. Existing centralized search structures can speed-up retrieval, but they do not scale up to large volume of data because the response time is linearly increasing with the size of the searched file. The proposed GHT* index is a scalable and distributed structure. By exploiting par...
متن کاملScalable Search Spaces for Scheduling Problems
This paper presents a tunable decoding procedure for Genetic Algorithm (GA) based schedule optimization. Tuning the decoding procedure of the algorithm scales the size of the search space of the underlying optimization problem. We show by experiment, that a tradeo exists between the advantage of searching a small space and the impacts of excluding near-optimal solutions from being searched at t...
متن کاملScalable and Distributed Similarity Search in Metric Spaces
In this paper we propose a new access structure, called GHT*, based on generalized hyperplane tree (GHT) and distributed dynamic hashing (DDH) techniques. GHT* is a distributed structure which allows to perform range search in a metric space according to a distance function d. The structure does not require a central directory and it is able to gracefully scale through splits of one bucket at a...
متن کاملScalable Partitioning and Exploration of Chemical Spaces Using Geometric Hashing
Virtual screening (VS) has become a preferred tool to augment high-throughput screening(1) and determine new leads in the drug discovery process. The core of a VS informatics pipeline includes several data mining algorithms that work on huge databases of chemical compounds containing millions of molecular structures and their associated data. Thus, scaling traditional applications such as class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inventiones Mathematicae
سال: 2022
ISSN: ['0020-9910', '1432-1297']
DOI: https://doi.org/10.1007/s00222-022-01118-9